Search results for " conditional random quantities"
showing 10 items of 15 documents
Iterated Conditionals and Characterization of P-Entailment
2021
In this paper we deepen, in the setting of coherence, some results obtained in recent papers on the notion of p-entailment of Adams and its relationship with conjoined and iterated conditionals. We recall that conjoined and iterated conditionals are suitably defined in the framework of conditional random quantities. Given a family \(\mathcal {F}\) of n conditional events \(\{E_{1}|H_{1},\ldots , E_{n}|H_{n}\}\) we denote by \(\mathcal {C}(\mathcal {F})=(E_{1}|H_{1})\wedge \cdots \wedge (E_{n}|H_{n})\) the conjunction of the conditional events in \(\mathcal F\). We introduce the iterated conditional \(\mathcal {C}(\mathcal {F}_{2})|\mathcal {C}(\mathcal {F}_{1})\), where \(\mathcal {F}_{1}\)…
Probabilistic entailment and iterated conditionals
2020
In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval $[0,1]$. We examine the iterated conditional $(B|K)|(A|H)$, by showing that $A|H$ p-entails $B|K$ if and only if $(B|K)|(A|H) = 1$. Then, we show that a p-consistent family $\mathcal{F}=\{E_1|H_1,E_2|H_2\}$ p-entails a conditional event $E_3|H_3$ if and only if $E_3|H_3=1$, or $(E_3|H_3)|QC(\mathcal{S})=1$ for some nonempty subset $\mathcal{S}$ of $\mathcal{F}$, where $QC(\mathcal{S})$ is the quasi conjunction of the conditional events in $\mathcal{S}$. Then, we examine the inference rules $A…
Interpreting Connexive Principles in Coherence-Based Probability Logic
2021
We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form If \(\mathord {\thicksim }A\), then A, should not hold, since the conditional’s antecedent \(\mathord {\thicksim }A\) contradicts its consequent A. Our approach covers this intuition by observing that for an event A the only coherent probability assessment on the conditional event \(A|\bar{A}\) is \(p(A|\bar{A})=0\). Moreover, connexive logics aim to capture the intuition that conditionals should express some “connection” between the antecedent and the consequent or, in terms of inferences, valid…
Algebraic aspects and coherence conditions for conjunctions among conditional events
2018
We deepen the study of a notion of conjunction among conditional events, introduced in previous papers in theframework of coherence. This notion of conjunction, differently from other approaches, is given in the setting ofconditional random quantities. We show that some well known properties which are satisfied by conjunctionsof unconditional events are also satisfied by conjunctions of conditional events. In particular we examine anadditive property and a decomposition formula, by also obtaining a generalized inclusion-exclusion formula. Then,by exploiting the notion of conjunction, we introduce the set of constituents generated bynconditional events.Moreover, under logical independence, w…
Logical Operations among Conditional Events: theoretical aspects and applications
2019
We generalize the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. These notions are defined, in the setting of coherence, by means of suitable conditional random quantities with values in the interval $[0,1]$. We also define the notion of negation, by verifying De Morgan's Laws. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals and we show that some well known properties which are satisfied by conjunctions and disjunctions of unconditional events are also satisfied by conjunctions and disjunction of conditional events. We also examine in detail the coherence of the prevision a…
On compound and iterated conditionals
2021
We illustrate the notions of compound and iterated conditionals introduced, in recent papers, as suitable conditional random quantities, in the framework of coherence. We motivate our definitions by examining some concrete examples. Our logical operations among conditional events satisfy the basic probabilistic properties valid for unconditional events. We show that some, intuitively acceptable, compound sentences on conditionals can be analyzed in a rigorous way in terms of suitable iterated conditionals. We discuss the Import-Export principle, which is not valid in our approach, by also examining the inference from a material conditional to the associated conditional event. Then, we illus…
On general conditional random quantities
2009
In the first part of this paper, recalling a general discussion on iterated conditioning given by de Finetti in the appendix of his book, vol. 2, we give a representation of a conditional random quantity $X|HK$ as $(X|H)|K$. In this way, we obtain the classical formula $\pr{(XH|K)} =\pr{(X|HK)P(H|K)}$, by simply using linearity of prevision. Then, we consider the notion of general conditional prevision $\pr(X|Y)$, where $X$ and $Y$ are two random quantities, introduced in 1990 in a paper by Lad and Dickey. After recalling the case where $Y$ is an event, we consider the case of discrete finite random quantities and we make some critical comments and examples. We give a notion of coherence fo…
Generalized Logical Operations among Conditional Events
2018
We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan's Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Fr'echet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $mathc…
Conjunction and Disjunction Among Conditional Events
2017
We generalize, in the setting of coherence, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. Given a prevision assessment on the conjunction of two conditional events, we study the set of coherent extensions for the probabilities of the two conditional events. Then, we introduce by a progressive procedure the notions of conjunction and disjunction for n conditional events. Moreover, by defining the negation of conjunction and of disjunction, we show that De Morgan’s Laws still hold. We also show that the associative and commutative properties are satisfied. Finally, we examine in detail the conjunction for a family \(\mathcal F\) of t…
Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals
2023
We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, then A, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event A | not-A is p(A | not-A) = 0. In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms of suitable probabilistic constraints on con…